Extracting Feature Curves on Point Sets

On Extracting Feature Models from Sets of Valid Feature Combinations

Rather than developing individual systems, Software Product Line Engineering develops families of systems. The members of the software family are distinguished by the features they implement and Feature Models (FMs) are the de facto standard for defining which feature combinations are considered valid members. This paper presents an algorithm to automatically extract a feature model from a set ...

Approximate Matching of Curves to Point Sets

Let P be a polygonal curve in R of length n, and S be a point set of size k. The Curve/Point Set Matching problem consists of finding a polygonal curve Q on S such that the Fréchet distance from P is less than a given ε. We consider eight variations of the problem based on the distance metric used and the omittability and repeatability of the points. We provide closure to a recent series of com...

On the geometric dilation of curves and point sets

Let G be an embedded planar graph whose edges are curves. The detour between two points u and v (on edges or vertices) of G is the ratio between the shortest path in G between u and v and their Euclidean distance. The maximum detour over all pairs of points is called the geometric dilation δ(G). Ebbers-Baumann, Grüne and Klein have recently shown that every finite point set is contained in a pl...

Motion Tracking of Dense Feature Point Sets

Extracting Complex Biological Events with Rich Graph-Based Feature Sets

We describe a system for extracting complex events among genes and proteins from biomedical literature, developed in context of the BioNLP’09 Shared Task on Event Extraction. For each event, its text trigger, class, and arguments are extracted. In contrast to the prevailing approaches in the domain, events can be arguments of other events, resulting in a nested structure that better captures th...